Monotone Paths in Random Hypergraphs

نویسندگان

  • Matteo Novaga
  • Pietro Majer
چکیده

We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set N, the set of all increasing k-tuples in N. These graphs appear as line graph of uniform hypergraphs with vertex set N.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

no-homomorphism conditions for hypergraphs

In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.

متن کامل

Exchangeable random hypergraphs

A hypergraph is a generalization of a graph in which an edge may contain more than two vertices. Hereditary hypergraphs are particularly important because they arise in mathematics as the class of monotone subsets, in statistics as the class of factorial models, in topology as simplicial complexes and in algebra as the free distributive lattice. An exchangeable random hypergraph consists of a p...

متن کامل

Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive

For a Boolean function f, let D(f) denote its deterministic decision tree complexity, i.e., minimum number of (adaptive) queries required in worst case in order to determine f. In a classic paper, Rivest and Vuillemin [19] show that any non-constant monotone property P : {0, 1}( n 2) → {0, 1} of n-vertex graphs has D(P) = Ω(n). We extend their result to 3-uniform hypergraphs. In particular, we ...

متن کامل

A Bayes Method for a Monotone Hazard Rate via S - Paths

A class of random hazard rates, which is defined as a mixture of an indicator kernel convolved with a completely random measure, is of interest. We provide an explicit characterization of the posterior distribution of this mixture hazard rate model via a finite mixture of S-paths. A closed and tractable Bayes estimator for the hazard rate is derived to be a finite sum over S-paths. The path cha...

متن کامل

A Bayes Method for a Monotone Hazard Rate via S-paths 1,2

A class of random hazard rates, that is defined as a mixture of an indicator kernel convoluted with a completely random measure, is of interest. We provide an explicit characterization of the posterior distribution of this mixture hazard rate model via a finite mixture of S-paths. A closed and tractable Bayes estimator for the hazard rate is derived to be a finite sum over S-paths. The path cha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2012